on the convergence analysis of gravitational search algorithm

gravitational search algorithm (gsa) is one of the newest swarm based optimization algorithms, which has been inspired by the newtonian laws of gravity and motion. gsa has empirically shown to be an efficient and robust stochastic search algorithm. since introducing gsa a convergence analysis of this algorithm has not yet been developed. this paper introduces the first attempt to a formal convergence analysis of the standard gravitational search algorithm which involves with randomness and time varying parameters. in this analysis the behavior of gsa on the facet of mass interaction is considered. the paper provides a formal proof that each object converges to a stable point.